Algorithmic Game Theory [[electronic resource] ] : 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings / / edited by Giuseppe Persiano |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (XI, 327 p. 26 illus., 8 illus. in color.) |
Disciplina | 003.3 |
Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
Soggetto topico |
Computer simulation
E-commerce Computers Computers and civilization Numerical analysis Mathematical statistics Simulation and Modeling e-Commerce/e-business Models and Principles Computers and Society Numeric Computing Probability and Statistics in Computer Science |
ISBN | 3-642-24829-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465381203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Complexity [[electronic resource] ] : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / / by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri |
Autore | Petreschi Rosella |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (X, 290 p.) |
Disciplina | 511/.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical logic
Algorithms Data structures (Computer science) Computers Computer science—Mathematics Computer graphics Mathematical Logic and Foundations Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices Discrete Mathematics in Computer Science Computer Graphics |
ISBN | 3-540-44849-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems. |
Record Nr. | UNINA-9910143860003321 |
Petreschi Rosella | ||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Complexity [[electronic resource] ] : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / / by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri |
Autore | Petreschi Rosella |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (X, 290 p.) |
Disciplina | 511/.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical logic
Algorithms Data structures (Computer science) Computers Computer science—Mathematics Computer graphics Mathematical Logic and Foundations Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices Discrete Mathematics in Computer Science Computer Graphics |
ISBN | 3-540-44849-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems. |
Record Nr. | UNISA-996465703903316 |
Petreschi Rosella | ||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Approximation and Online Algorithms [[electronic resource] ] : 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers / / edited by Thomas Erlebach, Giuseppe Persiano |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XII, 299 p. 39 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Application software Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computer and Information Systems Applications |
ISBN | 3-642-38016-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Contribution -- The Primal-Dual Approach for Online Algorithms -- Session 1: Graphs and Networks -- Independent Set with Advice: The Impact of Graph Knowledge -- Online Multi-Commodity Flow with High Demands -- Approximating Spanning Trees with Few Branches -- On the Complexity of the Regenerator Location Problem – Treewidth and Other Parameters -- Session 2: Geometric Problems -- Online Exploration of Polygons with Holes -- Probabilistic k-Median Clustering in Data Streams -- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs -- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods -- Session 3: Online Algorithms -- Asymptotically Optimal Online Page Migration on Three Points -- R–LINE: A Better Randomized 2-Server Algorithm on the Line -- Black and White Bin Packing -- Minimizing Cache Usage in Paging -- Session 4: Scheduling.Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems -- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling -- Approximating the Throughput by Coolest First Scheduling -- Algorithms for Cost-Aware Scheduling -- Session 5: Algorithmic Game Theory -- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games -- Some Anomalies of Farsighted Strategic Behavior -- Session 6: Approximation Algorithms Scheduling with an Orthogonal Resource Constraint -- Improved Approximation Guarantees for Lower-Bounded Facility Location -- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs -- Approximation Algorithms for the Wafer to Wafer Integration Problem. |
Record Nr. | UNISA-996466197003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Approximation and Online Algorithms [[electronic resource] ] : 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers / / edited by Thomas Erlebach, Giuseppe Persiano |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XII, 299 p. 39 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Application software Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computer and Information Systems Applications |
ISBN | 3-642-38016-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Contribution -- The Primal-Dual Approach for Online Algorithms -- Session 1: Graphs and Networks -- Independent Set with Advice: The Impact of Graph Knowledge -- Online Multi-Commodity Flow with High Demands -- Approximating Spanning Trees with Few Branches -- On the Complexity of the Regenerator Location Problem – Treewidth and Other Parameters -- Session 2: Geometric Problems -- Online Exploration of Polygons with Holes -- Probabilistic k-Median Clustering in Data Streams -- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs -- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods -- Session 3: Online Algorithms -- Asymptotically Optimal Online Page Migration on Three Points -- R–LINE: A Better Randomized 2-Server Algorithm on the Line -- Black and White Bin Packing -- Minimizing Cache Usage in Paging -- Session 4: Scheduling.Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems -- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling -- Approximating the Throughput by Coolest First Scheduling -- Algorithms for Cost-Aware Scheduling -- Session 5: Algorithmic Game Theory -- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games -- Some Anomalies of Farsighted Strategic Behavior -- Session 6: Approximation Algorithms Scheduling with an Orthogonal Resource Constraint -- Improved Approximation Guarantees for Lower-Bounded Facility Location -- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs -- Approximation Algorithms for the Wafer to Wafer Integration Problem. |
Record Nr. | UNINA-9910741159003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Approximation and Online Algorithms [[electronic resource] ] : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers / / edited by Roberto Solis-Oba, Giuseppe Persiano |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (X, 278 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Application software Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computer and Information Systems Applications |
ISBN | 3-642-29116-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Approximation Algorithms for Scheduling and Packing Problems / Klaus Jansen -- Approximating Subset k-Connectivity Problems / Zeev Nutov -- Learning in Stochastic Machine Scheduling / Sebastiâan Marbâan, Cyriel Rutten and Tjark Vredeveld -- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems / Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. -- Single Approximation for Biobjective Max TSP / Cristina Bazgan, Laurent Gourváes, Jâerãome Monnot and Fanny Pascual -- Parameterized Approximation Algorithms for Hitting Set / Ljiljana Brankovic and Henning Fernau -- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs / Nadine Schwartges, Joachim Spoerhase and Alexander Wolff -- Optimization over Integers with Robustness in Cost and Few Constraints / Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha -- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / Tomâaés Ebenlendr and Jiérâi Sgall -- Scheduling Jobs on Identical and Uniform Processors Revisited / Klaus Jansen and Christina Robenek.
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat / David B. Shmoys and Gwen Spencer -- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models / Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam -- A New Perspective on List Update: Probabilistic Locality and Working Set / Reza Dorrigiv and Alejandro Lâopez-Ortiz -- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm / Gerth St²lting Brodal, Gabriel Moruz and Andrei Negoescu -- Faster and Simpler Approximation of Stable Matchings / Katarzyna Paluch -- Simpler 3/4-Approximation Algorithms for MAX SAT / Anke van Zuylen -- On Online Algorithms with Advice for the k-Server Problem / Marc P. Renault and Adi Rosâen -- Improved Lower Bound for Online Strip Packing / (Extended Abstract) / Rolf Harren and Walter Kern -- Competitive Router Scheduling with Structured Data / Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz -- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems / Cristina Bazgan, Laurent Gourváes and Jâerãome Monnot -- Generalized Maximum Flows over Time / Martin GroÇ and Martin Skutella -- The Price of Anarchy for Minsum Related Machine Scheduling / Ruben Hoeksma and Marc Uetz. |
Record Nr. | UNISA-996466000103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Approximation and Online Algorithms [[electronic resource] ] : Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers / / edited by Thomas Erlebach, Giuseppe Persiano |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (X, 349 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence—Data processing Software Engineering Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science |
ISBN | 3-540-32208-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | “Almost Stable” Matchings in the Roommates Problem -- On the Minimum Load Coloring Problem -- Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT -- The Hardness of Network Design for Unsplittable Flow with Selfish Users -- Improved Approximation Algorithm for Convex Recoloring of Trees -- Exploiting Locality: Approximating Sorting Buffers -- Approximate Fair Cost Allocation in Metric Traveling Salesman Games -- Rounding of Sequences and Matrices, with Applications -- A Note on Semi-online Machine Covering -- SONET ADMs Minimization with Divisible Paths -- The Conference Call Search Problem in Wireless Networks -- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents -- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost -- A Better-Than-Greedy Algorithm for k-Set Multicover -- Deterministic Online Optical Call Admission Revisited -- Scheduling Parallel Jobs with Linear Speedup -- Online Removable Square Packing -- The Online Target Date Assignment Problem -- Approximation and Complexity of k–Splittable Flows -- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem -- Tighter Approximations for Maximum Induced Matchings in Regular Graphs -- On Approximating Restricted Cycle Covers -- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs -- Speed Scaling of Tasks with Precedence Constraints -- Partial Multicuts in Trees -- Approximation Schemes for Packing with Item Fragmentation. |
Record Nr. | UNISA-996466153003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Approximation and Online Algorithms [[electronic resource] ] : Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers / / edited by Thomas Erlebach, Giuseppe Persiano |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (X, 349 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence—Data processing Software Engineering Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science |
ISBN | 3-540-32208-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | “Almost Stable” Matchings in the Roommates Problem -- On the Minimum Load Coloring Problem -- Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT -- The Hardness of Network Design for Unsplittable Flow with Selfish Users -- Improved Approximation Algorithm for Convex Recoloring of Trees -- Exploiting Locality: Approximating Sorting Buffers -- Approximate Fair Cost Allocation in Metric Traveling Salesman Games -- Rounding of Sequences and Matrices, with Applications -- A Note on Semi-online Machine Covering -- SONET ADMs Minimization with Divisible Paths -- The Conference Call Search Problem in Wireless Networks -- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents -- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost -- A Better-Than-Greedy Algorithm for k-Set Multicover -- Deterministic Online Optical Call Admission Revisited -- Scheduling Parallel Jobs with Linear Speedup -- Online Removable Square Packing -- The Online Target Date Assignment Problem -- Approximation and Complexity of k–Splittable Flows -- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem -- Tighter Approximations for Maximum Induced Matchings in Regular Graphs -- On Approximating Restricted Cycle Covers -- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs -- Speed Scaling of Tasks with Precedence Constraints -- Partial Multicuts in Trees -- Approximation Schemes for Packing with Item Fragmentation. |
Record Nr. | UNINA-9910483079503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Approximation and Online Algorithms [[electronic resource] ] : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers / / edited by Giuseppe Persiano, Roberto Solis-Oba |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (VIII, 295 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed Multicuts -- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria -- Approximation Algorithms for Spreading Points -- More Powerful and Simpler Cost-Sharing Methods -- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints -- Priority Algorithms for Graph Optimization Problems -- Pricing Network Edges to Cross a River -- Submodular Integer Cover and Its Application to Production Planning -- Stochastic Online Scheduling on Parallel Machines -- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path -- Order-Preserving Transformations and Greedy-Like Algorithms -- Off-line Admission Control for Advance Reservations in Star Networks -- Joint Base Station Scheduling -- Universal Bufferless Routing -- Strong Colorings of Hypergraphs -- Deterministic Monotone Algorithms for Scheduling on Related Machines -- Better Bounds for Minimizing SONET ADMs. |
Record Nr. | UNISA-996465950503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Approximation and Online Algorithms [[electronic resource] ] : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers / / edited by Giuseppe Persiano, Roberto Solis-Oba |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (VIII, 295 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence - Data processing Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed Multicuts -- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria -- Approximation Algorithms for Spreading Points -- More Powerful and Simpler Cost-Sharing Methods -- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints -- Priority Algorithms for Graph Optimization Problems -- Pricing Network Edges to Cross a River -- Submodular Integer Cover and Its Application to Production Planning -- Stochastic Online Scheduling on Parallel Machines -- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path -- Order-Preserving Transformations and Greedy-Like Algorithms -- Off-line Admission Control for Advance Reservations in Star Networks -- Joint Base Station Scheduling -- Universal Bufferless Routing -- Strong Colorings of Hypergraphs -- Deterministic Monotone Algorithms for Scheduling on Related Machines -- Better Bounds for Minimizing SONET ADMs. |
Record Nr. | UNINA-9910767548803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|